Maintaining Minimum Spanning Forests in Dynamic Graphs
نویسندگان
چکیده
We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time o( √ n) per operation. To be precise, the algorithm uses O(n1/3 logn) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1/3 logn) per update, with O(1) worst case time per query.
منابع مشابه
Fully Dynamic Maintenance of Optimum Directed Spanning Forests
We present and analyze a fully dynamic algorithm for maintaining minimum cost directed spanning forests (branchings) in the presence of arc deletions and insertions. We provide algorithms that maintain a data structure, when an arc is deleted from or inserted in the digraph. Queries to the data structure for the optimum branching are answered in O(n) time, while the cost of an optimum branching...
متن کاملMaintaining Minimum Spanning Trees in Dynamic Graphs
We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o( √ n) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and, bipartiteness in amortized time O(n1...
متن کاملFully Sequential and Distributed Dynamic Algorithms for Minimum Spanning Trees
In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update e ciently the minimum spanning tree after dynamic changes like edge weight changes, rather than having to recompute it from scatch each time. The rst part of the paper surveys various algorithm...
متن کاملExperimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights
We consider the problem of maintaining a minimum spanning tree of a dynamically changing graph, subject to changes on edge weights. We propose an on-line fully-dynamic algorithm that runs in time O(|E|) when the easy-to-implement DRD-trees data structure for dynamic trees is used. Numerical experiments illustrate the efficiency of the approach.
متن کاملMaintaining dynamic graph properties deterministically
In this paper we present deterministic fully dynamic algorithms for maintaining several properties on undirected graphs subject to edge insertions and deletions, in polylogarithmic time per operation. Combining techniques from [6, 10], we can maintain a minimum spanning forest of a graph with k different edge weights in O(k log n) amortized time per update; maintain an 1+ -approximation of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 31 شماره
صفحات -
تاریخ انتشار 2001